全文获取类型
收费全文 | 1608篇 |
免费 | 452篇 |
国内免费 | 142篇 |
出版年
2023年 | 7篇 |
2022年 | 26篇 |
2021年 | 32篇 |
2020年 | 28篇 |
2019年 | 21篇 |
2018年 | 14篇 |
2017年 | 97篇 |
2016年 | 112篇 |
2015年 | 70篇 |
2014年 | 95篇 |
2013年 | 158篇 |
2012年 | 178篇 |
2011年 | 176篇 |
2010年 | 76篇 |
2009年 | 92篇 |
2008年 | 77篇 |
2007年 | 124篇 |
2006年 | 126篇 |
2005年 | 120篇 |
2004年 | 111篇 |
2003年 | 89篇 |
2002年 | 51篇 |
2001年 | 56篇 |
2000年 | 52篇 |
1999年 | 30篇 |
1998年 | 32篇 |
1997年 | 32篇 |
1996年 | 30篇 |
1995年 | 16篇 |
1994年 | 9篇 |
1993年 | 12篇 |
1992年 | 17篇 |
1991年 | 15篇 |
1990年 | 13篇 |
1989年 | 7篇 |
1988年 | 1篇 |
排序方式: 共有2202条查询结果,搜索用时 31 毫秒
51.
被动导引头对噪声调频源镜像目标抑制技术 总被引:2,自引:0,他引:2
研究了相位干涉仪体制被动导引头对噪声调频干扰源地面镜像目标抑制技术,分析了地面镜像目标对相位干涉仪测角的影响,给出了一种相位干涉仪体制被动导引头抑制噪声调频干扰源地面镜像目标影响的方法。 相似文献
52.
53.
54.
We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
55.
56.
In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
57.
针对伪码截获这一无线电侦察和导航战中的难题,从模式识别的角度研究存在自干扰码时的伪码截获问题。通过对干扰码的载波频率、相位等参数的估计和补偿,将自干扰码下的伪码截获问题转换为模式识别问题。结合伪码的周期性,采用二进制积累的方法大大降低了判决前所要求的信噪比,使得对扩频信号直接解调以截获伪码成为可能,改变了过去依靠大口径天线提高信噪比的方法。 相似文献
58.
Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
59.
设计了倾角较小的GEO导航星的广播星历拟合算法。该方法的核心思想是在常规拟合算法的基础上对位置观测量进行合理的坐标系参考平面旋转,特别是提出针对拟合迭代初值进行相应的坐标变换,从而既可以解决轨道参数拟合的相关性问题,使轨道参数拟合快速收敛,同时又兼顾了用户接收机的计算简便化。通过仿真验证,该方法简洁有效,拟合中误差RMS在厘米量级,能够保证拟合精度。 相似文献
60.
针对大规模数据集的分类问题,支持向量机的训练成为一个难题。增量学习是解决这一难题的思路之一。分析了新增样本加入训练集后支持向量集的变化情况,提出了一种基于密度法的支持向量机增量学习淘汰算法,淘汰了对最终分类无用的样本,在保证测试精度的同时减少了训练时间。实验仿真证明这种算法是有效的。 相似文献